Information-theoretically secure oblivious polynomial evaluation in the commodity-based model
نویسندگان
چکیده
منابع مشابه
Sequentially Composable Information Theoretically Secure Oblivious Polynomial Evaluation
Oblivious polynomial evaluation (OPE) consists of a twoparty protocol where a sender inputs a polynomial P , and a receiver inputs a single value i. At the end of the protocol, the sender learns nothing and the receiver learns P (i). This paper deals with the problem of oblivious polynomial evaluation under an information-theoretical perspective, which is based on recent definitions of Uncondit...
متن کاملImplementing Information-Theoretically Secure Oblivious Transfer from Packet Reordering
If we assume that adversaries have unlimited computational capabilities, secure computation between mutually distrusting players can not be achieved using an error-free communication medium. However, secure multi-party computation becomes possible when a noisy channel is available to the parties. For instance, the Binary Symmetric Channel (BSC) has been used to implement Oblivious Transfer (OT)...
متن کاملInformation Theoretically Secure Databases
We introduce the notion of a database system that is information theoretically secure in between accesses—a database system with the properties that 1) users can efficiently access their data, and 2) while a user is not accessing their data, the user’s information is information theoretically secure to malicious agents, provided that certain requirements on the maintenance of the database are r...
متن کاملInformation Theoretically Secure Communication in the Limited Storage Space Model
We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-storage-space model postulates an eavesdropper who can execute arbitrarily complex computations, and is only limited in the total amount of storage space (not computation space) available to him. The bound on the storage space c...
متن کاملSecure Multiparty Overall Mean Computation via Oblivious Polynomial Evaluation
The number of opportunities for cooperative computation has exponentially been increasing with growing interaction via Internet technologies. Most of the time, the communicating parties may not want to disclose their private data to the other principal while taking the advantage of collaboration, hence concentrating on the results rather than private and perhaps useless data values. To conduct ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information Security
سال: 2014
ISSN: 1615-5262,1615-5270
DOI: 10.1007/s10207-014-0247-8